Coupons collecting with or without replacement, and with multipurpose coupons
نویسنده
چکیده
The classic Coupon-Collector Problem (CCP) is generalized. Only basic probability theory is used. Centerpiece rather is an algorithm that efficiently counts all k-element transversals of a set system.
منابع مشابه
Coupon Collecting with or without Replacement, and with Multipurpose Coupons
The classic Coupon-Collector Problem (CCP) is generalized. Only basic probability theory is used. Centerpiece rather is an algorithm that efficiently counts all k-element transversals of a set system.
متن کاملDid Japan's shopping coupon program increase spending?
a r t i c l e i n f o In March 1999, 31 million " shopping coupons " worth 20,000 yen each were distributed to Japanese families with children and to the elderly. The coupons expired after six months and could only be used within the recipient's local community. We use variation in the number of children across families and in the number of recipients across prefectures to measure the effect of...
متن کاملThe Coupon Subset Collection Problem
The coupon subset collection problem is a generalization of the classical coupon collecting problem, in that rather than collecting individual coupons we obtain, at each time point, a random subset of coupons. The problem of interest is to determine the expected number of subsets needed until each coupon is contained in at least one of these subsets. We provide bounds on this number, give effic...
متن کاملOptimal strategy of coupon subset collection when each package contains half of the coupons
The coupon subset collection is a generalization of the classical coupon collection, where instead of selecting (with replacement) a single coupon, a subset of at most k coupons (known as a “package”) is selected in each round. In this paper, we study how to design the collection of packages and assign probabilities to the packages, so as to minimize the expected number of rounds to collect all...
متن کاملCoupon Collecting with Quotas
We analyze a variant of the coupon collector’s problem, in which the probabilities of obtaining coupons and the numbers of coupons in a collection may be non-uniform. We obtain a finite expression for the generating function of the probabilities to complete a collection and show how this generalizes several previous results about the coupon collector’s problem. Also, we provide applications abo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1107.1401 شماره
صفحات -
تاریخ انتشار 2011